https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 Possession assessment and capacity evaluation of the Central Queensland Coal Network https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26358 Wed 22 Jan 2020 13:04:47 AEDT ]]> The network maintenance problem https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:32246 Wed 04 Sep 2019 12:18:04 AEST ]]> Maintenance scheduling in a railway corridor https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:32245 Wed 04 Sep 2019 12:18:03 AEST ]]> Scheduling unit time arc shutdowns to maximize network flow over time: complexity results https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:17509 Wed 04 Sep 2019 11:04:58 AEST ]]> An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12826 Thu 16 Aug 2018 10:13:06 AEST ]]> Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13719 Sat 24 Mar 2018 08:22:59 AEDT ]]> A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21703 a) a∈A. We permit parallel arcs, i.e. there may exist more than one arc in A having the same start and end node. By dδ¯(v) and dδ+ (v) we denote the set of incoming and outgoing arcs of node v, respectively. We consider this network over a set of T time periods indexed by the set [T] := {1, 2, . . . ,T }, and our objective is to maximize the total flow from s to t. In addition, we are given a subset J ⊆ A of arcs that have to be shut down for exactly one time period in the time horizon. In other words, there is a set of maintenance jobs, one for each arc in J, each with unit processing time. Our optimization problem is to choose these outage time periods in such a way that the total flow from s to t is maximized. More formally, this can be written as a mixed binary program as follows: (formula could not be replicated: see full text) where xai ≥ 0 for a ∈ A and i ∈ [T] denotes the flow on arc a in time period i, and yai ∈ {0, 1} for a ∈ J and i ∈ [T] indicates when the arc a is not shut down for maintenance in time period i. We present a branch-and-bound algorithm called the "Partial-State algorithm" to solve the problem for single transhipment node networks i.e. networks with |V| = 3. Unit processing time of each job leads to formation of symmetries in the solution space. We include powerful symmetry breaking rules in the algorithm to make it more efficient. We provide an easily-computer combinatorial expression that is proved to give the value of LP-relaxation of the problem at each node of the branch-and-bound tree. We also provide another upper bound which is even stronger than the LP value at each node of the tree, and show how this improves the run time of the algorithm.]]> Sat 24 Mar 2018 08:06:24 AEDT ]]> Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:25381 Sat 24 Mar 2018 07:39:09 AEDT ]]> Modelling the capacity of the Hunter Valley Coal Chain to support capacity alignment of maintenance activities https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28927 Sat 24 Mar 2018 07:31:26 AEDT ]]> Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:27960 Mon 23 Sep 2019 11:29:20 AEST ]]> Scheduling of maintenance windows in a mining supply chain rail network https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:46210 Mon 15 Apr 2024 11:13:59 AEST ]]>